/**
*      author: Y_Yao
*      created: 2025-01-16 21:28:27
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 100 + 7;
int T[N],L[N];
int n,d;

void solve()
{
    cin >> n >> d;
    for(int i = 1;i <= n ;i++)
    {
        cin >> T[i] >> L[i];
    } 

    for(int i = 1;i <= d;i++)
    {
        int ma = -INF;
        for(int j = 1;j <= n;j++)
        {
            ma = max(ma,T[j] * (L[j] + i));
        }
        cout << ma << endl;
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}